Fast global optimization of SixHy clusters: new mutation operators in the cluster genetic algorithm
نویسندگان
چکیده
An improved strategy for finding the ab initio global minimum of SixHy clusters based on a cluster genetic algorithm (CGA) is presented. Four new mutation operators are introduced which better facilitate retention of desirable structural features between the different generations of clusters in the CGA. The new CGA generally finds global minima with fewer energy evaluations and is now able to find the problem global minima for Si14H20 and Si6H6 which were not as readily located by our previous CGA. The new CGA is used to find the global minima for the even larger Si18H24 and Si18H22 clusters. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Global Optimization of SixHy at the Ab Initio Level via an Iteratively Parametrized Semiempirical Method
Previously we searched for the ab initio global minima of several SixHy clusters by a genetic algorithm in which we used the AM1 semiempirical method to facilitate a rapid energy calculation for the many different cluster geometries explored. However, we found that the AM1 energy ranking significantly differs from the ab initio energy ranking. To better guarantee locating the ab initio global m...
متن کاملSTRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM
The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...
متن کاملخوشهبندی خودکار داده‌ها با بهره‌گیری از الگوریتم رقابت استعماری بهبودیافته
Imperialist Competitive Algorithm (ICA) is considered as a prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optim...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملOPTIMAL OPERATORS OF GENETIC ALGORITHM IN OPTIMIZING SEGMENTAL PRECAST CONCRETE BRIDGES SUPERSTRUCTURE
Bridges constitute an expensive segment of construction projects; the optimization of their designs will affect their high cost. Segmental precast concrete bridges are one of the most commonly serviced bridges built for mid and long spans. Genetic algorithm is one of the most widely applied meta-heuristic algorithms due to its ability in optimizing cost. Next to providing cost optimization of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004